New exact algorithms for planar maximum covering location by ellipses problems

Planar Maximum Covering Location by Ellipses is an optimization problem where one wants to choose the location of ellipses given their major and minor axes cover demand points, maximizing a function depending on value covered points. We propose new exact algorithms for two versions this problem, have be parallel coordinate axes, another they can freely rotated. Besides finding optimal solutions previously published instances, including ones no solution was known, both proposed us were able obtain some larger instances with up seven hundred points five ellipses.